<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>shark::KHCTree&lt; Container, CuttingAccuracy &gt; Class Template Reference</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="namespaceshark.html">shark</a></li><li class="navelem"><a class="el" href="classshark_1_1_k_h_c_tree.html">KHCTree</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="classshark_1_1_k_h_c_tree-members.html">List of all members</a> &#124;
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="#pro-attribs">Protected Attributes</a>  </div>
  <div class="headertitle"><div class="title">shark::KHCTree&lt; Container, CuttingAccuracy &gt; Class Template Reference<div class="ingroups"><a class="el" href="group__models.html">Models</a> &raquo; <a class="el" href="group__space__trees.html">Space Partitioning Trees</a></div></div></div>
</div><!--header-->
<div class="contents">

<p>KHC-tree, a binary space-partitioning tree.  
 <a href="classshark_1_1_k_h_c_tree.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="_k_h_c_tree_8h_source.html">shark/Models/Trees/KHCTree.h</a>&gt;</code></p>
<div id="dynsection-0" onclick="return toggleVisibility(this)" class="dynheader closed" style="cursor:pointer;">
  <img id="dynsection-0-trigger" src="closed.png" alt="+"/> Inheritance diagram for shark::KHCTree&lt; Container, CuttingAccuracy &gt;:</div>
<div id="dynsection-0-summary" class="dynsummary" style="display:block;">
</div>
<div id="dynsection-0-content" class="dyncontent" style="display:none;">
<div class="center"><img src="classshark_1_1_k_h_c_tree__inherit__graph.png" border="0" usemap="#ashark_1_1_k_h_c_tree_3_01_container_00_01_cutting_accuracy_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="ashark_1_1_k_h_c_tree_3_01_container_00_01_cutting_accuracy_01_4_inherit__map" id="ashark_1_1_k_h_c_tree_3_01_container_00_01_cutting_accuracy_01_4_inherit__map">
<area shape="rect" title="KHC&#45;tree, a binary space&#45;partitioning tree." alt="" coords="5,94,193,135"/>
<area shape="rect" title=" " alt="" coords="17,5,181,46"/>
<area shape="poly" title=" " alt="" coords="102,62,102,94,96,94,96,62"/>
</map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-types" name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:ad38d5c94143d0fdb8e1c0677edee6a8b" id="r_ad38d5c94143d0fdb8e1c0677edee6a8b"><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="classshark_1_1_indexed_iterator.html">IndexedIterator</a>&lt; typename boost::range_iterator&lt; Container const  &gt;::type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a></td></tr>
<tr class="separator:ad38d5c94143d0fdb8e1c0677edee6a8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a44fbdc20c35370cf39cdaada4bd76620" id="r_a44fbdc20c35370cf39cdaada4bd76620"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a44fbdc20c35370cf39cdaada4bd76620">KHCTree</a> (Container const &amp;points, <a class="el" href="classshark_1_1_abstract_kernel_function.html">kernel_type</a> const *<a class="el" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c">kernel</a>, <a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> tc=<a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>())</td></tr>
<tr class="separator:a44fbdc20c35370cf39cdaada4bd76620"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a266d14a6be4ace74d919d7244a967cd8" id="r_a266d14a6be4ace74d919d7244a967cd8"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a266d14a6be4ace74d919d7244a967cd8">squaredDistanceLowerBound</a> (value_type const &amp;reference) const</td></tr>
<tr class="separator:a266d14a6be4ace74d919d7244a967cd8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a2adecacb10d6e1d61d1d6a626ea22cfd" id="r_a2adecacb10d6e1d61d1d6a626ea22cfd"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a2adecacb10d6e1d61d1d6a626ea22cfd">KHCTree</a> (<a class="el" href="classshark_1_1_k_h_c_tree.html">KHCTree</a> *<a class="el" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>, std::size_t *list, std::size_t <a class="el" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>)</td></tr>
<tr class="memdesc:a2adecacb10d6e1d61d1d6a626ea22cfd"><td class="mdescLeft">&#160;</td><td class="mdescRight">(internal) construction of a non-root node  <br /></td></tr>
<tr class="separator:a2adecacb10d6e1d61d1d6a626ea22cfd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a96ac23e4df78cfa576aae64ba7600b97" id="r_a96ac23e4df78cfa576aae64ba7600b97"><td class="memTemplParams" colspan="2">template&lt;class Range &gt; </td></tr>
<tr class="memitem:a96ac23e4df78cfa576aae64ba7600b97"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">buildTree</a> (<a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> tc, Range &amp;points)</td></tr>
<tr class="separator:a96ac23e4df78cfa576aae64ba7600b97"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3af2b2683dfe8b119f248e54c1c5d044" id="r_a3af2b2683dfe8b119f248e54c1c5d044"><td class="memTemplParams" colspan="2">template&lt;class Range &gt; </td></tr>
<tr class="memitem:a3af2b2683dfe8b119f248e54c1c5d044"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">calculateNormal</a> (Range const &amp;samples)</td></tr>
<tr class="separator:a3af2b2683dfe8b119f248e54c1c5d044"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a98f61360f2c9a9a6ebc9b9ad995c77a7" id="r_a98f61360f2c9a9a6ebc9b9ad995c77a7"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">funct</a> (value_type const &amp;reference) const</td></tr>
<tr class="memdesc:a98f61360f2c9a9a6ebc9b9ad995c77a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">function describing the separating hyperplane  <br /></td></tr>
<tr class="separator:a98f61360f2c9a9a6ebc9b9ad995c77a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-attribs" name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:acd6aae2b85d97855361171d95de281b9" id="r_acd6aae2b85d97855361171d95de281b9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_abstract_kernel_function.html">kernel_type</a> const  *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9">mep_kernel</a></td></tr>
<tr class="memdesc:acd6aae2b85d97855361171d95de281b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">kernel function  <br /></td></tr>
<tr class="separator:acd6aae2b85d97855361171d95de281b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a62c2a26944e5c4d7f6ce9a93208b4956" id="r_a62c2a26944e5c4d7f6ce9a93208b4956"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956">mep_positive</a></td></tr>
<tr class="memdesc:a62c2a26944e5c4d7f6ce9a93208b4956"><td class="mdescLeft">&#160;</td><td class="mdescRight">"positive" side cluster center  <br /></td></tr>
<tr class="separator:a62c2a26944e5c4d7f6ce9a93208b4956"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a65a65d149ed69d95c9c8782e42cd0226" id="r_a65a65d149ed69d95c9c8782e42cd0226"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226">mep_negative</a></td></tr>
<tr class="memdesc:a65a65d149ed69d95c9c8782e42cd0226"><td class="mdescLeft">&#160;</td><td class="mdescRight">"negative" side cluster center  <br /></td></tr>
<tr class="separator:a65a65d149ed69d95c9c8782e42cd0226"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a55cfdcc3419ef36d6f4fa2455ebb54ab" id="r_a55cfdcc3419ef36d6f4fa2455ebb54ab"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab">m_normalInvNorm</a></td></tr>
<tr class="memdesc:a55cfdcc3419ef36d6f4fa2455ebb54ab"><td class="mdescLeft">&#160;</td><td class="mdescRight">one divided by squared distance between "positive" and "negative" cluster center  <br /></td></tr>
<tr class="separator:a55cfdcc3419ef36d6f4fa2455ebb54ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a100ef54d8a4904afff8c188bf4e735f9" id="r_a100ef54d8a4904afff8c188bf4e735f9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a100ef54d8a4904afff8c188bf4e735f9">mep_parent</a></td></tr>
<tr class="memdesc:a100ef54d8a4904afff8c188bf4e735f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">parent node  <br /></td></tr>
<tr class="separator:a100ef54d8a4904afff8c188bf4e735f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a14c17e4fc65d1351cc23eceae05ce0d0" id="r_a14c17e4fc65d1351cc23eceae05ce0d0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">mp_left</a></td></tr>
<tr class="memdesc:a14c17e4fc65d1351cc23eceae05ce0d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">"left" child node  <br /></td></tr>
<tr class="separator:a14c17e4fc65d1351cc23eceae05ce0d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acc95bb731d3bfac4a896820f8de04ad8" id="r_acc95bb731d3bfac4a896820f8de04ad8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8">mp_right</a></td></tr>
<tr class="memdesc:acc95bb731d3bfac4a896820f8de04ad8"><td class="mdescLeft">&#160;</td><td class="mdescRight">"right" child node  <br /></td></tr>
<tr class="separator:acc95bb731d3bfac4a896820f8de04ad8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afdce442d41868d9a84dcfc954c78ce93" id="r_afdce442d41868d9a84dcfc954c78ce93"><td class="memItemLeft" align="right" valign="top">std::size_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#afdce442d41868d9a84dcfc954c78ce93">mp_indexList</a></td></tr>
<tr class="memdesc:afdce442d41868d9a84dcfc954c78ce93"><td class="mdescLeft">&#160;</td><td class="mdescRight">list of indices to points in the dataset  <br /></td></tr>
<tr class="separator:afdce442d41868d9a84dcfc954c78ce93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a825e00e68228cb1654b5ac0a25f4972a" id="r_a825e00e68228cb1654b5ac0a25f4972a"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a">m_size</a></td></tr>
<tr class="memdesc:a825e00e68228cb1654b5ac0a25f4972a"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of points in this node  <br /></td></tr>
<tr class="separator:a825e00e68228cb1654b5ac0a25f4972a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad07d8f306001f8e1bc9a321a3d11444e" id="r_ad07d8f306001f8e1bc9a321a3d11444e"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_k_h_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">m_nodes</a></td></tr>
<tr class="memdesc:ad07d8f306001f8e1bc9a321a3d11444e"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of nodes in the sub-tree represented by this node  <br /></td></tr>
<tr class="separator:ad07d8f306001f8e1bc9a321a3d11444e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;class Container, int CuttingAccuracy = 25&gt;<br />
class shark::KHCTree&lt; Container, CuttingAccuracy &gt;</div><p>KHC-tree, a binary space-partitioning tree. </p>
<dl class="section user"><dt></dt><dd>KHC-tree data structure for efficient nearest neighbor searches in kernel-induced feature spaces. "KHC" stands for Kernel Hierarchical Clustering. The space separation is based on distances to cluster centers.</dd></dl>
<dl class="section user"><dt></dt><dd>The tree is constructed from data by splitting along the pair of data points with largest distance. This quantity is approximated using a given number of randomly sampled pairs, which is controlled by the template parameter CuttingAccuracy.</dd></dl>
<dl class="section user"><dt></dt><dd>The bucket size for the tree is always one, such that there is a unique point in each leaf cell.</dd></dl>
<p>Since the <a class="el" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> needs direct access to the elements, it's template parameter is not the actual point type But the Range, the points are stored in. Be aware that this range should be a View when a Dataset is used as storage, since during construction, the KHC-Tree needs random access to the elements. </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00075">75</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>
</div><h2 class="groupheader">Member Typedef Documentation</h2>
<a id="ad38d5c94143d0fdb8e1c0677edee6a8b" name="ad38d5c94143d0fdb8e1c0677edee6a8b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad38d5c94143d0fdb8e1c0677edee6a8b">&#9670;&#160;</a></span>const_iterator</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">typedef <a class="el" href="classshark_1_1_indexed_iterator.html">IndexedIterator</a>&lt;typename boost::range_iterator&lt;Container const&gt;::type&gt; <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::const_iterator</td>
        </tr>
      </table>
</div><div class="memdoc">

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00078">78</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a44fbdc20c35370cf39cdaada4bd76620" name="a44fbdc20c35370cf39cdaada4bd76620"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a44fbdc20c35370cf39cdaada4bd76620">&#9670;&#160;</a></span>KHCTree() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::KHCTree </td>
          <td>(</td>
          <td class="paramtype">Container const &amp;&#160;</td>
          <td class="paramname"><em>points</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classshark_1_1_abstract_kernel_function.html">kernel_type</a> const *&#160;</td>
          <td class="paramname"><em>kernel</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>&#160;</td>
          <td class="paramname"><em>tc</em> = <code><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>()</code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Construct the tree from data. It is assumed that the container exceeds the lifetime of the <a class="el" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> (which holds only references to the points), and that the memory locations of the points remain unchanged. </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00089">89</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::m_size</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#afdce442d41868d9a84dcfc954c78ce93">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mp_indexList</a>.</p>

</div>
</div>
<a id="a2adecacb10d6e1d61d1d6a626ea22cfd" name="a2adecacb10d6e1d61d1d6a626ea22cfd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2adecacb10d6e1d61d1d6a626ea22cfd">&#9670;&#160;</a></span>KHCTree() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::KHCTree </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classshark_1_1_k_h_c_tree.html">KHCTree</a>&lt; Container, CuttingAccuracy &gt; *&#160;</td>
          <td class="paramname"><em>parent</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">std::size_t *&#160;</td>
          <td class="paramname"><em>list</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">std::size_t&#160;</td>
          <td class="paramname"><em>size</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>(internal) construction of a non-root node </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00138">138</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a96ac23e4df78cfa576aae64ba7600b97" name="a96ac23e4df78cfa576aae64ba7600b97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a96ac23e4df78cfa576aae64ba7600b97">&#9670;&#160;</a></span>buildTree()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<div class="memtemplate">
template&lt;class Range &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::buildTree </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>&#160;</td>
          <td class="paramname"><em>tc</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Range &amp;&#160;</td>
          <td class="paramname"><em>points</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>(internal) construction method: median-cuts of the dimension with widest spread </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00147">147</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::calculateNormal()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::funct()</a>, <a class="el" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">shark::BinaryTree&lt; Container::value_type &gt;::left()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::m_nodes</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::m_size</a>, <a class="el" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad">shark::TreeConstruction::maxBucketSize()</a>, <a class="el" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373">shark::TreeConstruction::maxDepth()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#afdce442d41868d9a84dcfc954c78ce93">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mp_indexList</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mp_left</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mp_right</a>, <a class="el" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">shark::TreeConstruction::nextDepthLevel()</a>, <a class="el" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb">shark::BinaryTree&lt; InputT &gt;::nodes()</a>, <a class="el" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">shark::BinaryTree&lt; Container::value_type &gt;::right()</a>, and <a class="el" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55">shark::BinaryTree&lt; Container::value_type &gt;::splitList()</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a44fbdc20c35370cf39cdaada4bd76620">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::KHCTree()</a>.</p>

</div>
</div>
<a id="a3af2b2683dfe8b119f248e54c1c5d044" name="a3af2b2683dfe8b119f248e54c1c5d044"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3af2b2683dfe8b119f248e54c1c5d044">&#9670;&#160;</a></span>calculateNormal()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<div class="memtemplate">
template&lt;class Range &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::calculateNormal </td>
          <td>(</td>
          <td class="paramtype">Range const &amp;&#160;</td>
          <td class="paramname"><em>samples</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00200">200</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">References <a class="el" href="namespaceshark.html#af2ab10364feb8a631e0866dcf2f1a4ad">shark::batchSize()</a>, <a class="el" href="classshark_1_1_abstract_kernel_function.html#a4526b02196952d7af3bc76633c8bd6b7">shark::AbstractKernelFunction&lt; InputTypeT &gt;::featureDistanceSqr()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::m_normalInvNorm</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_kernel</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_negative</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_positive</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="a98f61360f2c9a9a6ebc9b9ad995c77a7" name="a98f61360f2c9a9a6ebc9b9ad995c77a7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a98f61360f2c9a9a6ebc9b9ad995c77a7">&#9670;&#160;</a></span>funct()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">double <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::funct </td>
          <td>(</td>
          <td class="paramtype">value_type const &amp;&#160;</td>
          <td class="paramname"><em>reference</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>function describing the separating hyperplane </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00221">221</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_abstract_kernel_function.html#abd10e3815efade90c7f9e2a7cc8bcb6c">shark::AbstractKernelFunction&lt; InputTypeT &gt;::eval()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::m_normalInvNorm</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_kernel</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_negative</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_positive</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="a266d14a6be4ace74d919d7244a967cd8" name="a266d14a6be4ace74d919d7244a967cd8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a266d14a6be4ace74d919d7244a967cd8">&#9670;&#160;</a></span>squaredDistanceLowerBound()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">double <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::squaredDistanceLowerBound </td>
          <td>(</td>
          <td class="paramtype">value_type const &amp;&#160;</td>
          <td class="paramname"><em>reference</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<dl class="section user"><dt></dt><dd>Compute the squared distance of this cell to the given reference point, or alternatively a lower bound on this value. </dd></dl>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00113">113</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_k_h_c_tree.html#a100ef54d8a4904afff8c188bf4e735f9">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mep_parent</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::mp_right</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="ad07d8f306001f8e1bc9a321a3d11444e" name="ad07d8f306001f8e1bc9a321a3d11444e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad07d8f306001f8e1bc9a321a3d11444e">&#9670;&#160;</a></span>m_nodes</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::size_t <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::m_nodes</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>number of nodes in the sub-tree represented by this node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00361">361</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="a55cfdcc3419ef36d6f4fa2455ebb54ab" name="a55cfdcc3419ef36d6f4fa2455ebb54ab"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a55cfdcc3419ef36d6f4fa2455ebb54ab">&#9670;&#160;</a></span>m_normalInvNorm</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">double <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::m_normalInvNorm</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>one divided by squared distance between "positive" and "negative" cluster center </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00238">238</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::calculateNormal()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::funct()</a>.</p>

</div>
</div>
<a id="a825e00e68228cb1654b5ac0a25f4972a" name="a825e00e68228cb1654b5ac0a25f4972a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a825e00e68228cb1654b5ac0a25f4972a">&#9670;&#160;</a></span>m_size</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::size_t <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::m_size</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>number of points in this node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00358">358</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a44fbdc20c35370cf39cdaada4bd76620">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::KHCTree()</a>.</p>

</div>
</div>
<a id="acd6aae2b85d97855361171d95de281b9" name="acd6aae2b85d97855361171d95de281b9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acd6aae2b85d97855361171d95de281b9">&#9670;&#160;</a></span>mep_kernel</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_abstract_kernel_function.html">kernel_type</a> const* <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::mep_kernel</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>kernel function </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00229">229</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::calculateNormal()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::funct()</a>.</p>

</div>
</div>
<a id="a65a65d149ed69d95c9c8782e42cd0226" name="a65a65d149ed69d95c9c8782e42cd0226"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a65a65d149ed69d95c9c8782e42cd0226">&#9670;&#160;</a></span>mep_negative</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a> <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::mep_negative</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>"negative" side cluster center </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00235">235</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::calculateNormal()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::funct()</a>.</p>

</div>
</div>
<a id="a100ef54d8a4904afff8c188bf4e735f9" name="a100ef54d8a4904afff8c188bf4e735f9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a100ef54d8a4904afff8c188bf4e735f9">&#9670;&#160;</a></span>mep_parent</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a>* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mep_parent</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>parent node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00346">346</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a266d14a6be4ace74d919d7244a967cd8">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::squaredDistanceLowerBound()</a>.</p>

</div>
</div>
<a id="a62c2a26944e5c4d7f6ce9a93208b4956" name="a62c2a26944e5c4d7f6ce9a93208b4956"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a62c2a26944e5c4d7f6ce9a93208b4956">&#9670;&#160;</a></span>mep_positive</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a> <a class="el" href="classshark_1_1_k_h_c_tree.html">shark::KHCTree</a>&lt; Container, CuttingAccuracy &gt;::mep_positive</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>"positive" side cluster center </p>

<p class="definition">Definition at line <a class="el" href="_k_h_c_tree_8h_source.html#l00232">232</a> of file <a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::calculateNormal()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::funct()</a>.</p>

</div>
</div>
<a id="afdce442d41868d9a84dcfc954c78ce93" name="afdce442d41868d9a84dcfc954c78ce93"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afdce442d41868d9a84dcfc954c78ce93">&#9670;&#160;</a></span>mp_indexList</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::size_t* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mp_indexList</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>list of indices to points in the dataset </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00355">355</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a44fbdc20c35370cf39cdaada4bd76620">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::KHCTree()</a>.</p>

</div>
</div>
<a id="a14c17e4fc65d1351cc23eceae05ce0d0" name="a14c17e4fc65d1351cc23eceae05ce0d0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a14c17e4fc65d1351cc23eceae05ce0d0">&#9670;&#160;</a></span>mp_left</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a>* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mp_left</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>"left" child node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00349">349</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="acc95bb731d3bfac4a896820f8de04ad8" name="acc95bb731d3bfac4a896820f8de04ad8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acc95bb731d3bfac4a896820f8de04ad8">&#9670;&#160;</a></span>mp_right</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Container , int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a>* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mp_right</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>"right" child node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00352">352</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_k_h_c_tree.html#a266d14a6be4ace74d919d7244a967cd8">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::squaredDistanceLowerBound()</a>.</p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>include/shark/Models/Trees/<a class="el" href="_k_h_c_tree_8h_source.html">KHCTree.h</a></li>
</ul>
</div><!-- contents -->
</div>
</body>
</html>
